Pdmi Preprint — 21/2006 Automated Proofs of Upper Bounds for Np-hard Problems: Implementation Details
نویسنده
چکیده
Recently, several programs for automated analysis of the running time of splitting algorithms were implemented. In this paper we provide the details of implementation of the program presented by Fedin and Kulikov and indicate several ways of its improvement. Supported in part by INTAS (grants 04-77-7173 and 05-109-5352), RFBR (grants 05-01-00932, 06-01-00502, and 06-01-00584), and RAS Program for Fundamental Research (“Modern Problems of Theoretical Mathematics”).
منابع مشابه
Automated Proofs of Time Lower Bounds
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, MOD6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. These lower bound proofs all follow a certain diagonalization-based proof-by-contradiction strategy....
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملAutomated Generation of Search Tree Algorithms for Graph Modification Problems
We present a (seemingly first) framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold—rapid development and improved upper bounds. Many search tree algorithms for various problems in the literature are based on complicated case distinctions. Our approach may lead to a much simpler process of developing and analyzing th...
متن کاملA Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints
In this paper a branch-and-bound algorithm is proposed for finding a global minimum to a Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints (MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a Complementarity Active-Set Algorithm for computing upper bounds. Computational results for solving MPECs associated with Bilivel Problems, ...
متن کاملAutomated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles
The Heilbronn problem for triangle[Wei] is defined as follows: place N points inside a triangle of unit area, so as to maximize the area of the smallest triangle obtained by choosing 3 points among N. Several authors worked towards finding lower bounds or optimal configurations of points. In this paper, we propose upper bounds for those problems, obtained by a method of automated theorem proving.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006